ON 2-REGULAR, k-NONCROSSING PARTITIONS
نویسندگان
چکیده
In this paper we prove a bijection between 2-regular, k-noncrossing partitions and k-noncrossing enhanced partitions. Via this bijection we enumerate 2-regular, 3-noncrossing partitions using an enumeration result [1] for enhanced 3-noncrossing partitions. In addition we derive the asymptotics for the numbers of 2-regular, 3-noncrossing partitions using the BirkhoffTrijtzinky analytic theory of singular difference equations.
منابع مشابه
ON k-NONCROSSING PARTITIONS
In this paper we prove a duality between k-noncrossing partitions over [n] = {1, . . . , n} and k-noncrossing braids over [n − 1]. This duality is derived directly via (generalized) vacillating tableaux which are in correspondence to tangled-diagrams [6]. We give a combinatorial interpretation of the bijection in terms of the contraction of arcs of tangled-diagrams. Furthermore it induces by re...
متن کاملReduction of m-regular noncrossing partitions
In this paper, we present a reduction algorithm which transforms m-regular partitions of [n] = {1, 2, . . . , n} to (m−1)-regular partitions of [n − 1]. We show that this algorithm preserves the noncrossing property. This yields a simple explanation of an identity due to Simion-Ullman and Klazar in connection with enumeration problems on noncrossing partitions and RNA secondary structures. For ...
متن کاملA Combinatorial Framework for Rna Tertiary Interaction
In this paper we show how to express RNA tertiary interactions via the concepts of tangled diagrams. Tangled diagrams allow to formulate RNA base triples and pseudoknotinteractions and to control the maximum number of mutually crossing arcs. In particular we study two subsets of tangled diagrams: 3-noncrossing tangled-diagrams with l vertices of degree two and 2-regular, 3-noncrossing partition...
متن کاملEnumeration of bilaterally symmetric 3-noncrossing partitions
Schützenberger’s theorem for the ordinary RSK correspondence naturally extends to Chen et. al’s correspondence for matchings and partitions. Thus the counting of bilaterally symmetric k-noncrossing partitions naturally arises as an analogue for involutions. In obtaining the analogous result for 3-noncrossing partitions, we use a different technique to develop a MAPLE package for 2-dimensional v...
متن کاملBijections on two variations of noncrossing partitions
A (set) partition of [n] = {1, 2, . . . , n} is a collection of mutually disjoint nonempty subsets, called blocks, of [n] whose union is [n]. We will write a partition as a sequence of blocks (B1, B2, . . . , Bk) such that min(B1) < min(B2) < · · · < min(Bk). There are two natural representations of a partition. Let π = (B1, B2, . . . , Bk) be a partition of [n]. The partition diagram of π is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009